Efficient Least-significant-bits Steganography for VoIP

نویسندگان

  • Jin Liu
  • Ke Zhou
  • Hui Tian
  • Cunhua Li
چکیده

For the instantaneity of real-time applications such as voice over Internet protocol (VoIP), the processing delay and efficiency need to be carefully considered. Matrix coding is a widely used coding scheme for steganography to improve the embedding efficiency which means the average hiding bits per covering bit change. In order to take full advantage of it, a classifying least-significant-bits (LSB) with frame window (CLFW) scheme is proposed for low bitrate speech covers in VoIP communication. The classifying method selects LSB with similar characteristics which bring consistent effect to speech quality for every bit modification. Meanwhile, the frame window strategy collects more speech frames in VoIP speech stream for matrix coding, which enhances the embedding efficiency. In CLFW, frame LSB are classified into three levels to construct separate sets of covering bits, which limits the range of embedding modification. As a result, the speech quality degradation caused by feature discrepancies of speech frames is minimized. The experimental results demonstrate that CLFW method largely increases the embedding efficiency compared with existing schemes and is much more imperceptible than direct matrix coding and simple LSB steganography.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Steganography Scheme Based on Reed-Muller Code with Improving Payload and Ability to Retrieval of Destroyed Data for Digital Images

In this paper, a new steganography scheme with high embedding payload and good visual quality is presented. Before embedding process, secret information is encoded as block using Reed-Muller error correction code. After data encoding and embedding into the low-order bits of host image, modulus function is used to increase visual quality of stego image. Since the proposed method is able to embed...

متن کامل

An Efficient Method for Image and Audio Steganography using Least Significant Bit (LSB) Substitution

In order to improve the data hiding in all types of multimedia data formats such as image and audio and to make hidden message imperceptible, a novel method for steganography is introduced in this paper. It is based on Least Significant Bit (LSB) manipulation and inclusion of redundant noise as secret key in the message. This method is applied to data hiding in images. For data hiding in audio,...

متن کامل

Conceptual Design of Edge Adaptive Steganography Scheme Based on Advanced Lsb Algorithm

This research article outlines the efficient algorithm in which secrete data are embedded in edge regions of the image. Here region selection totally depending on size of the secrete message. If less information to be embedded, then sharp regions in the image are selected for embedding bits. If the size of secrete information is large, then the more edge regions are released to accommodate all ...

متن کامل

The Steganography In Inactive Frames Of Voip

This paper describes a novel high-capacity steganography algorithm for embedding data in the inactive frames of low bit rate audio streams encoded by G.723.1 source codec, which isused extensively in Voice over Internet Protocol (VoIP). This study reveals that, contrary to existing thought, the inactive frames of VoIP streams are more suitable for data embedding than the active frames of the st...

متن کامل

Enhanced Approach to Steganography Using Bitplanes

Steganography is the concept of embedding information in such a way that its existence is concealed. In this paper we have shown one of the techniques used in Steganography to hide information and deliver the message to the end user using Bit-planes without any loss of data. The method used is to replace lowest 3 or 4 LSB with message bits or image data (assume 8 bit values). We do this method ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013